A novel testability-oriented data path scheduling scheme in high-level synthesis
نویسندگان
چکیده
منابع مشابه
Testability-driven High-level Synthesis
This paper describes a new approach to integrate testability consideration into high-level synthesis. The approach is based on an iterative technique for high-level synthesis which utilizes a sequence of design-improvement transformations to generate a register-transfer level design from a VHDL behavioral specification. A testability analysis algorithm is used to analyze the intermediate result...
متن کاملTestability Improvement During High-Level Synthesis
Improving testability during the early stages of HighLevel Synthesis (HLS) reduces test hardware overheads, test costs, design iterations, and also improves fault coverage [1]. In this paper, we present a novel register allocation algorithm which is based on weighted graph coloring, targeting testability improvement. 1. Proposed testability model In our register allocation method, we construct ...
متن کاملUsing high - level synthesis to implement on - line testability
On-line testing increases system reliability, which is essential in a number of applications. High-level synthesis, on the other hand, offers fast time-to-market and allows quick and painless design space exploration. In this work, we investigate on-line testing in the high-level synthesis context. Further, we propose a new technique (inversion testing) and demonstrate its potential benefits. 1...
متن کاملScheduling Strategies in High-Level Synthesis
T/ie paper describes objcctives of high-level synthesis. It concentrates on operation scheduling strategies and thc interaction with the resource allocation. Some transformational and iterative/constructive scheduling algorithms are described. Moreover, a new scheduling/alhcation approach is prcsented and compared with other known algorithms. Finally, some open problems of the high-levcl synthe...
متن کاملA Statistical-based Scheduling Algorithm in Automated Data Path Synthesis
In this paper, we propose a new heuristic scheduling algorithm based on the statistical analysis of the cumulative frequency distribution of operations among control steps. It has a tendency of escaping from local minima and therefore reaching a globally optimal solution. The presented algorithm considers the real world constraints such as chained operations, multicycle operations, and pipeline...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tsinghua Science and Technology
سال: 2007
ISSN: 1007-0214
DOI: 10.1016/s1007-0214(07)70098-6